Potential Energy Benchmark for Lecture Timetable Problem
نویسندگان
چکیده
منابع مشابه
The multi-objective railway timetable rescheduling problem
Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of large disruptions. The originality of our approach is to integrate three objectives to generate a disposition timetable: the passenger satisfact...
متن کاملDecomposing the High School Timetable Problem
The process of timetable construction is a common and repetitive task for High Schools worldwide. In this paper a generic approach is presented for Greek High Schools organized around the idea of solving a significant number of tractable Integer Programming problems. Variables of the underlying mathematical model correspond to daily teacher schedules while a number of hard and soft constraints ...
متن کاملThe Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be minimized. The problem consists of finding an optimal home-away assignment when the opponents of each team in each time slot are given. We present an integer programming, a constraint programming formulation and describ...
متن کاملModel-Based Problem Solving for University Timetable Validation and Improvement
Constraint satisfaction problems can be expressed very elegantly in state-based formal methods such as B. However, can such specifications be directly used for solving real-life problems? We will try to answer this question in this contribution with regard to the university timetabling problem. We report on an ongoing project to build a formal model-based curriculum timetable validation tool. I...
متن کاملA Multiple-Neighborhoods-Based Simulated Annealing Algorithm for Timetable Problem
This paper presents a simulated annealing algorithm that based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm also can solve those problems that can be solved by local search algorithm. Various experimental results show that the new algorithm can actually give more satisfactory solutions than general simulated annealing algorithm can do.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TECNICA ITALIANA-Italian Journal of Engineering Science
سال: 2019
ISSN: 0040-1846
DOI: 10.18280/ti-ijes.632-409